Operational Semantics Models of Complexity ( Thesis proposal )
نویسنده
چکیده
Deenitions of complexity are traditionally given relative to a relatively low-level, machine-oriented model of computation. As programming languages become more complex, the relation between a program and its machine model time, space, etc., complexities becomes less clear. An alternative is to provide a language-oriented deenition of complexity in terms of costs that make sense for that language and its semantics. The language-level complexity can then be related to the machine-level complexity. The programmer can use the more intuitive language-level deenition and then use this relation, which is proved separately, to obtain machine-oriented complexities when needed.
منابع مشابه
Functorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملCoinductive Program Verification - Thesis Proposal
Every programming language should have a formal semantics, and sound verification tools. Giving an operational semantics is hardly more difficult than writing an interpreter, but traditional approaches to enabling program verification, such as defining and proving sound an axiomatic semantics, require considerably more sophistication. For maximum confidence, a program verification tool should b...
متن کاملTitle: Topological Models in Comparative Semantics
During the last three decades several diierent styles of semantics for programming languages have been developed. This thesis compares two of them: the operational and the denotational approach. We show how to give operational and denotational semantics to programming languages, and how to compare diierent semantic models for a given language. Both in the deenition of the denotational semantics...
متن کاملTuple Inheritance: A New Kind of Inheritance for (Constraint) Logic Programming
In this paper, we present a new form of inheritance for (constraint) logic programming. This inheritance is informally de ned in the following terms: a module inherits from the other one the consequences that are not covered by itself (with respect to a xed tuple of arguments). A computable approximation to this de nition is studied, based on nite failure. In particular, we de ne the declarativ...
متن کامل